A decidable propositional dynamic logic with explicit probabilities
نویسندگان
چکیده
منابع مشابه
A Decidable Propositional Dynamic Logic with Explicit Probabilities
A propositional version of Feldman and Harel's PrDL (1982, "14th ACM Sympos. on Theory of Computing," pp. 181-195; J. Comput, System Sci. 28, No. 2 (1984), 193-215) is defined, and shown to be decidable in double-exponential space. The logic allows propositional-level formulas involving probabilistic programs, and contains the full (quantified) real-number theory for dealing with probabilities....
متن کاملA Decidable Logic for Time Intervals: Propositional Neighborhood Logic
Logics for time intervals provide a natural framework for representing and reasoning about timing properties in various areas of artificial intelligence and computer science. Unfortunately, most time interval logics proposed in the literature are (highly) undecidable. Decidable fragments of these logics have been obtained by imposing severe restrictions on their expressive power. In this paper,...
متن کاملA Decidable Timeout based Extension of Propositional Linear Temporal Logic
We develop a timeout based extension of propositional linear temporal logic (which we call TLTL) to specify timing properties of timeout based models of real time systems. TLTL formulas explicitly refer to a running global clock together with static timing variables as well as a dynamic variable abstracting the timeout behavior. We extend LTL with the capability to express timeout constraints. ...
متن کاملGeneralizing Propositional Dynamic Logic
A new semantics of Propositional Dynamic Logic (PDL) is given in terms of predicate transformers: Instead of associating the standard state transformer with each program, we model programs by operations on sets of states, operations which map postconditions to weakest liberal preconditions. This yields a logic more general than PDL since new program operations such as angelic choice become expr...
متن کاملNONDET~IIi~ISTiC PROPOSITIONAL DYNAMIC LOGIC ~ITH II~T~Q~ECTION IS DECIDABLE
Propositional Dynamic Logic (PDL) of [FL] defines meaning of programs in terms of binary input-output relations. Basic regular operations on programs are interpreted as superposition, union, and reflexive-transitive closure of relations. The intersection, cf. [HI , is a binary program forming functor a~b with the meaning given by the set-theoretical intersection of relations corresponding to pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1984
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(84)80039-x